package dataStructure.xmg1.leetCode.linkList;

/**
 *
 * 141. 环形链表
 * https://leetcode-cn.com/problems/linked-list-cycle/
 *
 * @author: vince_zww
 * @date: 2020/11/11 21:58
 * @desceription:
 *
 *
 */
public class LeetCode_141 {
    public boolean hasCycle(ListNode head) {

        if (head == null || head.next == null) {
            return false;
        }
        ListNode slow = head;
        ListNode fast = head.next;
        while (fast != null && fast.next != null) {
            slow = slow.next;
            fast = fast.next.next;
            if (slow == fast) {
                return true;
            }
        }
        return false;
    }



}
